Sparse geometric graphs with small dilationARONOV, Boris; DE BERG, Mark; CHEONG, Otfried et al.Lecture notes in computer science. 2005, pp 50-59, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

Using composite low rank and sparse graph for label propagationJUNJUN GUO; DAIWEN WU.Electronics letters. 2014, Vol 50, Num 2, pp 84-86, issn 0013-5194, 3 p.Article

Algorithms for the d-dimensional rigidity matroid of sparse graphsBEREG, Sergey.Lecture notes in computer science. 2005, pp 29-36, issn 0302-9743, isbn 3-540-30467-3, 1Vol, 8 p.Conference Paper

Maximum-size subgraphs of P4-sparse graphs admitting a perfect matchingNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2005, pp 68-79, issn 0302-9743, isbn 3-540-29673-5, 1Vol, 12 p.Conference Paper

New algorithms for enumerating all maximal cliquesMAKINO, Kazuhisa; UNO, Takeaki.Lecture notes in computer science. 2004, pp 260-272, issn 0302-9743, isbn 3-540-22339-8, 13 p.Conference Paper

Biconnectivity approximations and graph carvingsKHULLER, S; VISHKIN, U.Journal of the Association for Computing Machinery. 1994, Vol 41, Num 2, pp 214-235, issn 0004-5411Article

On the recognition of probe graphs of some self-complementary classes of perfect graphsCHANG, Maw-Shang; KLOKS, Ton; KRATSCH, Dieter et al.Lecture notes in computer science. 2005, pp 808-817, issn 0302-9743, isbn 3-540-28061-8, 10 p.Conference Paper

Solving Diameter Constrained Minimum Spanning tree problems in dense graphsDOS SANTOS, Andréa C; LUCENA, Abilio; RIBEIRO, Celso C et al.Lecture notes in computer science. 2004, pp 458-467, issn 0302-9743, isbn 3-540-22067-4, 10 p.Conference Paper

Fully Dynamic Geometric SpannersRODITTY, L.Algorithmica. 2012, Vol 62, Num 3-4, pp 1073-1087, issn 0178-4617, 15 p.Article

Distributed computing on regular networks with anonymous nodesLAKSHMAN, T. V; WEI, V. K.IEEE transactions on computers. 1994, Vol 43, Num 2, pp 211-218, issn 0018-9340Article

Experiments with the fixed-parameter approach for two-layer planarizationSUDERMAN, Matthew; WHITESIDES, Sue.Lecture notes in computer science. 2003, pp 345-356, issn 0302-9743, isbn 3-540-20831-3, 12 p.Conference Paper

A faster algorithm for finding maximum independent sets in sparse graphsFURER, Martin.Lecture notes in computer science. 2006, pp 491-501, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 11 p.Conference Paper

Spanners with slackCHAN, T.-H. Hubert; DINITZ, Michael; GUPTA, Anupam et al.Lecture notes in computer science. 2006, pp 196-207, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

EVALUATING RELATIONAL EXPRESSIONS WITH DENSE AND SPARSE ARGUMENTS.SZYMANSKI TG; ULLMAN JD.1977; S.I.A.M. J. COMPTG; U.S.A.; DA. 1977; VOL. 6; NO 1; PP. 109-122; BIBL. 7 REF.Article

A parametric filtering algorithm for the graph isomorphism problemSORLIN, Sébastien; SOLNON, Christine.Constraints (Dordrecht). 2008, Vol 13, Num 4, pp 518-537, issn 1383-7133, 20 p.Article

A fully dynamic algorithm for the recognition of P₄-sparse graphsNIKOLOPOULOS, Stavros D; PALIOS, Leonidas; PAPADOPOULOS, Charis et al.Lecture notes in computer science. 2006, pp 256-268, issn 0302-9743, isbn 3-540-48381-0, 13 p.Conference Paper

Exact crossing minimizationBUCHHEIM, Christoph; EBNER, Dietmar; JÜNGER, Michael et al.Lecture notes in computer science. 2006, pp 37-48, issn 0302-9743, isbn 3-540-31425-3, 1Vol, 12 p.Conference Paper

Networking Property During Epileptic Seizure with Multi-channel EEG RecordingsHUIHUA WU; XIAOLI LI; XINPING GUAN et al.Lecture notes in computer science. 2006, pp 564-569, issn 0302-9743, isbn 3-540-34439-X, 6 p.Conference Paper

Designing a Good Low-Rate Sparse-Graph CodeANDRIYANOVA, Iryna; TILLICH, Jean-Pierre.IEEE transactions on communications. 2012, Vol 60, Num 11, pp 3181-3190, issn 0090-6778, 10 p.Article

Distribution-Free Connectivity Testing for Sparse GraphsHALEVY, Shirley; KUSHILEVITZ, Eyal.Algorithmica. 2008, Vol 51, Num 1, pp 24-48, issn 0178-4617, 25 p.Article

Sparse directed acyclic word graphsINENAGA, Shunsuke; TAKEDA, Masayuki.Lecture notes in computer science. 2006, pp 63-73, issn 0302-9743, isbn 3-540-45774-7, 1Vol, 11 p.Conference Paper

I/O-Efficient algorithms on near-planar graphsHAVERKORT, Herman; TOMA, Laura.Lecture notes in computer science. 2006, pp 580-591, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

I/O-efficient undirected shortest paths with unbounded edge lengths (Extended Abstract)MEYER, Ulrich; ZEH, Norbert.Lecture notes in computer science. 2006, pp 540-551, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Sparse factor graph representations of reed-solomon and related codesYEDIDIA, Jonathan S.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 260Conference Paper

Random sampling in cut, flow, and network design problemsKARGER, D. R.Mathematics of operations research. 1999, Vol 24, Num 2, pp 383-413, issn 0364-765XArticle